________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:38:33
Input Data from:  dataset138.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,161
Average f[i]   :4750
Average g[i,j] :1927,77777777778
Total demand   :5570
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 48
> Selected Move:	1920	1	-1	17	6500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 1920


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 52
> Selected Move:	2510	1	-1	4	10500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 2510


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 32
> Selected Move:	3150	1	-1	16	16000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0    >new incumb.: 3150


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 31
> Selected Move:	3720	1	-1	15	21500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0    >new incumb.: 3720


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 31
> Selected Move:	3760	3	1	19	23300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  1  0  3    >new incumb.: 3760


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 39
> Selected Move:	3760	4	19	4	24400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 34
> Selected Move:	3760	4	4	15	22200


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  3  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 40
> Selected Move:	3760	4	15	16	22000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 42
> Selected Move:	3760	4	16	17	21000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 67
> Selected Move:	3980	1	-1	11	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  3  0  1    >new incumb.: 3980


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 23
> Selected Move:	3980	3	4	7	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 24
> Selected Move:	3940	3	11	4	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 26
> Selected Move:	3890	3	16	6	23500


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 35
> Selected Move:	3960	3	7	3	24500


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 31
> Selected Move:	3970	3	19	5	24500


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 23
> Selected Move:	3940	3	3	8	25000


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  1  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 20
> Selected Move:	3930	3	5	19	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  1  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 24
> Selected Move:	3930	3	8	11	23500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 33
> Selected Move:	3930	4	17	15	24700


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 28
> Selected Move:	3930	3	4	7	24700


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 26
> Selected Move:	3930	4	15	17	23500


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 44
> Selected Move:	3950	3	11	3	24500


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  0  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 38
> Selected Move:	3910	3	19	5	24500


> New Y[]: 
	
	 2  0  0  1  0  1  1  1  0  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 25
> Selected Move:	3860	3	3	8	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  1  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 22
> Selected Move:	3850	3	5	19	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  1  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 30
> Selected Move:	3860	3	8	18	24000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 29
> Selected Move:	3860	3	7	4	24000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 50
> Selected Move:	3890	3	18	14	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 34
> Selected Move:	3810	3	4	7	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  0  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 45
> Selected Move:	3770	3	15	18	24000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 28
> Selected Move:	3770	3	7	4	24000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 30
> Selected Move:	3770	3	19	5	24000


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 66
> Selected Move:	3790	3	14	15	24000


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 70
> Selected Move:	3790	3	4	7	24000


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 66
> Selected Move:	3780	3	18	11	23500


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  1  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 39
> Selected Move:	3830	3	6	16	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 22
> Selected Move:	3830	3	7	4	25000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 26
> Selected Move:	3780	3	16	6	23500


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  1  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 39
> Selected Move:	3780	4	17	15	24700


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  1  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 30
> Selected Move:	3780	3	4	7	24700


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  1  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 34
> Selected Move:	3724	3	11	18	25200


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  0  0  0  0  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 46
> Selected Move:	3795	3	5	19	25200


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  0  0  0  3  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 23
> Selected Move:	3890	3	18	4	24700


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  0  0  0  0  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 43
> Selected Move:	3797	3	7	18	25200


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  3  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 47
> Selected Move:	3743	3	18	3	25700


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 44
> Selected Move:	3757	3	19	5	25700


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  0  0  0  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 46 #######################


> Neighbours evaluated; 24
> Selected Move:	3728	3	3	18	25200


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  0  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 47 #######################


> Neighbours evaluated; 62
> Selected Move:	3710	3	18	7	24700


> New Y[]: 
	
	 2  0  0  0  1  1  1  1  0  0  0  0  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 48 #######################


> Neighbours evaluated; 35
> Selected Move:	3710	4	15	17	23500


> New Y[]: 
	
	 2  0  0  0  1  1  1  1  0  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 49 #######################


> Neighbours evaluated; 51
> Selected Move:	3760	3	6	16	25000


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 50 #######################


> Neighbours evaluated; 28
> Selected Move:	3690	3	7	3	26000


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 51 #######################


> Neighbours evaluated; 17
> Selected Move:	3700	2	5	-1	21500


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 52 #######################


> Neighbours evaluated; 28
> Selected Move:	3700	4	17	3	24000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 53 #######################


> Neighbours evaluated; 22
> Selected Move:	3700	4	3	4	24900


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 54 #######################


> Neighbours evaluated; 17
> Selected Move:	3700	4	4	15	22700


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 55 #######################


> Neighbours evaluated; 22
> Selected Move:	3700	4	15	16	22500


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  3  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 56 #######################


> Neighbours evaluated; 28
> Selected Move:	3690	3	3	5	22000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  3  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 57 #######################


> Neighbours evaluated; 40
> Selected Move:	3690	4	16	4	24400


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 58 #######################


> Neighbours evaluated; 24
> Selected Move:	3690	4	4	5	23100


> New Y[]: 
	
	 2  0  0  0  1  3  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 59 #######################


> Neighbours evaluated; 35
> Selected Move:	3690	4	5	15	22200


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  0  0  3  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 60 #######################


> Neighbours evaluated; 35
> Selected Move:	3690	4	15	17	21000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 61 #######################


> Neighbours evaluated; 47
> Selected Move:	3690	1	-1	6	25000


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 62 #######################


> Neighbours evaluated; 50
> Selected Move:	3760	3	5	19	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 63 #######################


> Neighbours evaluated; 43
> Selected Move:	3763	3	6	18	25500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  3  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 64 #######################


> Neighbours evaluated; 34
> Selected Move:	3765	3	4	7	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 65 #######################


> Neighbours evaluated; 39
> Selected Move:	3710	3	19	11	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 66 #######################


> Neighbours evaluated; 51
> Selected Move:	3710	3	7	4	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 67 #######################


> Neighbours evaluated; 58
> Selected Move:	3703	3	11	5	25500


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 68 #######################


> Neighbours evaluated; 56
> Selected Move:	3705	3	4	7	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 69 #######################


> Neighbours evaluated; 62
> Selected Move:	3685	3	18	3	26000


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  0  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 70 #######################


> Neighbours evaluated; 20
> Selected Move:	3685	3	5	11	25500


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  0  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 71 #######################


> Neighbours evaluated; 23
> Selected Move:	3770	3	16	6	24000


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  0  0  0  1  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 72 #######################


> Neighbours evaluated; 29
> Selected Move:	3770	3	7	4	24000


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  1  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 73 #######################


> Neighbours evaluated; 35
> Selected Move:	3713	4	17	15	25200


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  1  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 74 #######################


> Neighbours evaluated; 25
> Selected Move:	3712	3	4	7	25200


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  0  0  0  1  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 75 #######################


> Neighbours evaluated; 28
> Selected Move:	3744	3	11	19	25700


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  0  0  0  0  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 76 #######################


> Neighbours evaluated; 49
> Selected Move:	3700	3	19	5	25700


> New Y[]: 
	
	 2  0  0  1  0  1  1  1  0  0  0  0  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 77 #######################


> Neighbours evaluated; 29
> Selected Move:	3589	3	5	4	25200


> New Y[]: 
	
	 2  0  0  1  1  0  1  1  0  0  0  0  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 78 #######################


> Neighbours evaluated; 23
> Selected Move:	3650	4	15	17	24000


> New Y[]: 
	
	 2  0  0  1  1  0  1  1  0  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,315

## ITERATION 79 #######################


> Neighbours evaluated; 48
> Selected Move:	3650	3	7	18	24500


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,32

## ITERATION 80 #######################


> Neighbours evaluated; 64
> Selected Move:	3660	3	3	11	23500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 81 #######################


> Neighbours evaluated; 71
> Selected Move:	3710	3	4	19	24000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,33

## ITERATION 82 #######################


> Neighbours evaluated; 42
> Selected Move:	3710	3	18	14	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 83 #######################


> Neighbours evaluated; 40
> Selected Move:	3693	3	11	18	25500


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 84 #######################


> Neighbours evaluated; 31
> Selected Move:	3630	3	19	4	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 85 #######################


> Neighbours evaluated; 53
> Selected Move:	3710	3	18	5	25000


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 86 #######################


> Neighbours evaluated; 41
> Selected Move:	3770	3	15	3	24500


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  0  0  0  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 87 #######################


> Neighbours evaluated; 29
> Selected Move:	3770	3	4	7	24500


> New Y[]: 
	
	 2  0  0  1  0  1  1  1  0  0  0  0  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 88 #######################


> Neighbours evaluated; 30
> Selected Move:	3770	3	3	18	24000


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  0  0  0  1  0  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 89 #######################


> Neighbours evaluated; 68
> Selected Move:	3710	3	14	12	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  0  1  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 90 #######################


> Neighbours evaluated; 37
> Selected Move:	3760	3	5	19	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,305

## ITERATION 91 #######################


> Neighbours evaluated; 21
> Selected Move:	3760	3	7	4	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 92 #######################


> Neighbours evaluated; 25
> Selected Move:	3730	4	17	12	25100


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  3  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 93 #######################


> Neighbours evaluated; 28
> Selected Move:	3731	3	4	7	25100


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  3  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 94 #######################


> Neighbours evaluated; 39
> Selected Move:	3681	3	19	5	25100


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  0  3  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 95 #######################


> Neighbours evaluated; 64
> Selected Move:	3682	3	7	4	25100


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  3  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 96 #######################


> Neighbours evaluated; 45
> Selected Move:	3710	4	12	17	25000


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 97 #######################


> Neighbours evaluated; 66
> Selected Move:	3630	3	12	11	22500


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  1  0  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 98 #######################


> Neighbours evaluated; 81
> Selected Move:	3680	3	5	19	22500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 99 #######################


> Neighbours evaluated; 39
> Selected Move:	3730	3	18	13	24500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 100 #######################


> Neighbours evaluated; 40
> Selected Move:	3730	4	17	13	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  3  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 101 #######################


> Neighbours evaluated; 34
> Selected Move:	3730	3	4	7	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  3  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 102 #######################


> Neighbours evaluated; 29
> Selected Move:	3730	4	13	17	24500


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 103 #######################


> Neighbours evaluated; 56
> Selected Move:	3690	3	11	4	24500


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 104 #######################


> Neighbours evaluated; 39
> Selected Move:	3690	4	17	13	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  0  0  0  0  0  3  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 105 #######################


> Neighbours evaluated; 46
> Selected Move:	3620	3	13	14	24900


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  0  0  0  0  0  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 106 #######################


> Neighbours evaluated; 30
> Selected Move:	3678	3	4	18	25400


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  0  0  3  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 107 #######################


> Neighbours evaluated; 26
> Selected Move:	3680	3	7	4	25400


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  3  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 108 #######################


> Neighbours evaluated; 29
> Selected Move:	3682	3	19	5	25400


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  3  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 109 #######################


> Neighbours evaluated; 56
> Selected Move:	3684	3	4	7	25400


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  0  0  0  3  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 110 #######################


> Neighbours evaluated; 64
> Selected Move:	3581	3	18	3	25900


> New Y[]: 
	
	 2  0  0  1  0  1  1  1  0  0  0  0  0  0  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 111 #######################


> Neighbours evaluated; 34
> Selected Move:	3577	3	7	4	25900


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  0  0  0  0  0  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 112 #######################


> Neighbours evaluated; 33
> Selected Move:	3562	3	5	19	25900


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 113 #######################


> Neighbours evaluated; 23
> Selected Move:	3760	4	14	17	24500


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 114 #######################


> Neighbours evaluated; 43
> Selected Move:	3760	3	4	7	24500


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 115 #######################


> Neighbours evaluated; 40
> Selected Move:	3680	3	14	9	25000


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  0  1  0  0  0  0  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 116 #######################


> Neighbours evaluated; 33
> Selected Move:	3690	3	3	15	25500


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  1  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 117 #######################


> Neighbours evaluated; 37
> Selected Move:	3768	3	7	4	25500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  1  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 118 #######################


> Neighbours evaluated; 39
> Selected Move:	3720	3	9	5	24000


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 119 #######################


> Neighbours evaluated; 70
> Selected Move:	3710	2	5	-1	19500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 120 #######################


> Neighbours evaluated; 61
> Selected Move:	3710	4	17	4	22900


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 121 #######################


> Neighbours evaluated; 58
> Selected Move:	3710	4	4	6	22900


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 122 #######################


> Neighbours evaluated; 59
> Selected Move:	3710	4	6	15	20700


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 123 #######################


> Neighbours evaluated; 62
> Selected Move:	3710	4	15	19	21800


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 124 #######################


> Neighbours evaluated; 73
> Selected Move:	3738	1	-1	11	25800


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 125 #######################


> Neighbours evaluated; 38
> Selected Move:	3742	3	4	7	25800


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 126 #######################


> Neighbours evaluated; 39
> Selected Move:	3706	3	11	4	25800


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 127 #######################


> Neighbours evaluated; 53
> Selected Move:	3670	3	19	1	24000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 128 #######################


> Neighbours evaluated; 32
> Selected Move:	3940	3	7	5	24500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 129 #######################


> Neighbours evaluated; 39
> Selected Move:	3930	3	5	19	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 130 #######################


> Neighbours evaluated; 70
> Selected Move:	3850	3	4	7	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 131 #######################


> Neighbours evaluated; 65
> Selected Move:	3860	3	19	5	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 132 #######################


> Neighbours evaluated; 48
> Selected Move:	3730	3	5	18	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 133 #######################


> Neighbours evaluated; 76
> Selected Move:	3790	3	7	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 134 #######################


> Neighbours evaluated; 90
> Selected Move:	3770	3	18	3	25000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 135 #######################


> Neighbours evaluated; 33
> Selected Move:	3690	3	4	7	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 136 #######################


> Neighbours evaluated; 30
> Selected Move:	3670	3	3	11	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 137 #######################


> Neighbours evaluated; 48
> Selected Move:	3675	3	1	5	25600


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 138 #######################


> Neighbours evaluated; 49
> Selected Move:	3678	3	7	4	25600


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 139 #######################


> Neighbours evaluated; 41
> Selected Move:	3706	3	11	3	26600


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 140 #######################


> Neighbours evaluated; 32
> Selected Move:	3672	3	5	19	26800


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 141 #######################


> Neighbours evaluated; 46
> Selected Move:	3671	3	4	7	26800


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  0  0  0  0  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 142 #######################


> Neighbours evaluated; 42
> Selected Move:	3654	3	19	5	26600


> New Y[]: 
	
	 2  0  0  1  0  3  1  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 143 #######################


> Neighbours evaluated; 30
> Selected Move:	3611	3	3	4	25600


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 144 #######################


> Neighbours evaluated; 51
> Selected Move:	3640	2	7	-1	21600


> New Y[]: 
	
	 2  0  0  0  1  3  1  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 145 #######################


> Neighbours evaluated; 55
> Selected Move:	3670	3	5	1	20000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 146 #######################


> Neighbours evaluated; 48
> Selected Move:	3670	1	-1	10	26500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 147 #######################


> Neighbours evaluated; 29
> Selected Move:	3670	3	10	11	24000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 148 #######################


> Neighbours evaluated; 50
> Selected Move:	3625	3	6	16	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 149 #######################


> Neighbours evaluated; 26
> Selected Move:	3795	3	11	5	26000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 150 #######################


> Neighbours evaluated; 27
> Selected Move:	3780	3	5	19	26000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 151 #######################


> Neighbours evaluated; 65
> Selected Move:	3695	3	4	7	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 152 #######################


> Neighbours evaluated; 51
> Selected Move:	3700	3	19	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 153 #######################


> Neighbours evaluated; 28
> Selected Move:	3640	2	5	-1	21500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 154 #######################


> Neighbours evaluated; 36
> Selected Move:	3680	3	1	19	23300


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 155 #######################


> Neighbours evaluated; 56
> Selected Move:	3680	4	19	7	24500


> New Y[]: 
	
	 2  0  0  0  0  0  0  3  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 156 #######################


> Neighbours evaluated; 43
> Selected Move:	3680	4	7	15	22200


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 157 #######################


> Neighbours evaluated; 58
> Selected Move:	3698	1	-1	11	26200


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  1  0  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 158 #######################


> Neighbours evaluated; 27
> Selected Move:	3740	4	15	16	26000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 159 #######################


> Neighbours evaluated; 37
> Selected Move:	3735	3	7	4	26000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 160 #######################


> Neighbours evaluated; 42
> Selected Move:	3690	3	11	7	26000


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 161 #######################


> Neighbours evaluated; 40
> Selected Move:	3680	2	4	-1	22000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 162 #######################


> Neighbours evaluated; 55
> Selected Move:	3680	4	16	17	21000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 163 #######################


> Neighbours evaluated; 69
> Selected Move:	3685	1	-1	3	26000


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 164 #######################


> Neighbours evaluated; 32
> Selected Move:	3750	3	7	4	26000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 165 #######################


> Neighbours evaluated; 39
> Selected Move:	3688	3	19	11	25500


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  1  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 166 #######################


> Neighbours evaluated; 25
> Selected Move:	3600	3	15	5	24500


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 167 #######################


> Neighbours evaluated; 21
> Selected Move:	3610	3	16	6	23000


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  0  0  1  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 168 #######################


> Neighbours evaluated; 32
> Selected Move:	3690	3	11	9	25000


> New Y[]: 
	
	 2  0  0  1  1  1  1  0  0  1  0  0  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 169 #######################


> Neighbours evaluated; 29
> Selected Move:	3690	3	4	7	25000


> New Y[]: 
	
	 2  0  0  1  0  1  1  1  0  1  0  0  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 170 #######################


> Neighbours evaluated; 34
> Selected Move:	3620	3	3	18	24500


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  1  0  0  0  0  0  0  0  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 171 #######################


> Neighbours evaluated; 70
> Selected Move:	3630	3	9	11	22500


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  0  0  1  0  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 172 #######################


> Neighbours evaluated; 80
> Selected Move:	3680	3	5	19	22500


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 173 #######################


> Neighbours evaluated; 41
> Selected Move:	3680	4	17	18	24600


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 174 #######################


> Neighbours evaluated; 30
> Selected Move:	3680	4	18	19	24800


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 175 #######################


> Neighbours evaluated; 27
> Selected Move:	3680	3	7	4	24800


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 176 #######################


> Neighbours evaluated; 27
> Selected Move:	3680	4	19	18	24600


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 177 #######################


> Neighbours evaluated; 30
> Selected Move:	3660	3	18	14	24900


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 178 #######################


> Neighbours evaluated; 31
> Selected Move:	3660	4	14	17	23500


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 179 #######################


> Neighbours evaluated; 38
> Selected Move:	3710	3	6	16	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 180 #######################


> Neighbours evaluated; 37
> Selected Move:	3710	3	4	7	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 181 #######################


> Neighbours evaluated; 43
> Selected Move:	3670	3	11	4	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 182 #######################


> Neighbours evaluated; 37
> Selected Move:	3670	3	7	6	25000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 183 #######################


> Neighbours evaluated; 38
> Selected Move:	3670	2	6	-1	21000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 184 #######################


> Neighbours evaluated; 40
> Selected Move:	3670	4	17	4	24400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 185 #######################


> Neighbours evaluated; 32
> Selected Move:	3670	4	4	14	22400


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 186 #######################


> Neighbours evaluated; 36
> Selected Move:	3670	4	14	16	22000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 187 #######################


> Neighbours evaluated; 36
> Selected Move:	3670	4	16	19	23300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 188 #######################


> Neighbours evaluated; 44
> Selected Move:	3620	3	4	15	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 189 #######################


> Neighbours evaluated; 39
> Selected Move:	3620	4	19	14	23900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 190 #######################


> Neighbours evaluated; 42
> Selected Move:	3640	3	14	9	24200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 191 #######################


> Neighbours evaluated; 41
> Selected Move:	3640	4	9	15	24200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 192 #######################


> Neighbours evaluated; 41
> Selected Move:	3640	4	15	16	24000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 193 #######################


> Neighbours evaluated; 41
> Selected Move:	3640	4	16	17	23000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 194 #######################


> Neighbours evaluated; 49
> Selected Move:	3620	3	9	14	22500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 195 #######################


> Neighbours evaluated; 49
> Selected Move:	3708	1	-1	4	26500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 196 #######################


> Neighbours evaluated; 36
> Selected Move:	3755	3	14	8	26500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 197 #######################


> Neighbours evaluated; 35
> Selected Move:	3773	3	19	5	26500


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  1  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 198 #######################


> Neighbours evaluated; 26
> Selected Move:	3700	3	4	7	26500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 199 #######################


> Neighbours evaluated; 28
> Selected Move:	3698	3	5	19	26500


> New Y[]: 
	
	 2  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 200 #######################


> Neighbours evaluated; 39
> Selected Move:	3680	3	8	6	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 201 #######################


> Neighbours evaluated; 42
> Selected Move:	3745	3	16	12	26000


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  0  0  1  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 202 #######################


> Neighbours evaluated; 38
> Selected Move:	3740	3	7	4	26000


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  1  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 203 #######################


> Neighbours evaluated; 38
> Selected Move:	3720	4	17	12	26100


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  3  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 204 #######################


> Neighbours evaluated; 51
> Selected Move:	3738	3	12	8	26200


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  3  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 205 #######################


> Neighbours evaluated; 44
> Selected Move:	3742	3	19	5	26200


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  3  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 206 #######################


> Neighbours evaluated; 30
> Selected Move:	3736	4	8	15	26200


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  1  0  0  0  0  0  0  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 207 #######################


> Neighbours evaluated; 29
> Selected Move:	3720	3	5	19	26200


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  1  0  0  0  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 208 #######################


> Neighbours evaluated; 43
> Selected Move:	3684	3	8	5	25200


> New Y[]: 
	
	 2  0  0  0  1  1  1  0  0  0  0  0  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 209 #######################


> Neighbours evaluated; 73
> Selected Move:	3668	3	5	14	26200


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  0  0  0  0  0  0  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19
________________________________________________________________

Best solution found: 3980
Run Termination time: 03.02.2010 20:39:20
Run duration: 00:00:47.5937500
________________________________________________________________
